Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The bi-objective covering tour problem

The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the covering tour problem, which means that the covering distance and the associated constraints have been replaced by a new objective. We propose a two-phase cooperative strategy that combines a multi-objective evolutionar...

متن کامل

Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective

Column generation has been very useful in solving single objective vehicle routing problems (VRPs). Its role in a branch-and-price algorithm is to compute a lower bound which is then used in a branch-and-bound framework to guide the search for integer solutions. In spite of the success of the method, only a few papers treat its application to multi-objective problems and this paper seeks to con...

متن کامل

Robust optimal multi-objective controller design for vehicle rollover prevention

Robust control design of vehicles addresses the effect of uncertainties on the vehicle’s performance. In present study, the robust optimal multi-objective controller design on a non-linear full vehicle dynamic model with 8-degrees of freedom having parameter with probabilistic uncertainty considering two simultaneous conflicting objective functions has been made to prevent the rollover. The obj...

متن کامل

Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems

This paper proposes a framework named multiobjective ant colony optimization based on decomposition (MoACO/D) to solve bi-objective traveling salesman problems (bTSPs). In the framework, a bTSP is first decomposed into a number of scalar optimization subproblems using Tchebycheff approach. To suit for decomposition, an ant colony is divided into many subcolonies in an overlapped manner, each of...

متن کامل

Multi-Objective evolutionary algorithms for vehicle routing problems

The Vehicle Routing Problem, which main objective is to find the lowest-cost set of routes to deliver goods to customers, has many applications in transportation services. In the past, costs have been mainly associated to the number of routes and the travel distance, however, in real-world problems there exist additional objectives. Since there is no known exact method to efficiently solve the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2020

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2019.11.045